منابع مشابه
Size sensitive packing number for Hamming cube and its consequences
We prove a size-sensitive version of Haussler’s Packing lemma [7] for set-systems with bounded primal shatter dimension, which have an additional size-sensitive property. This answers a question asked by Ezra [9]. We also partially address another point raised by Ezra regarding overcounting of sets in her chaining procedure. As a consequence of these improvements, we get an improvement on the s...
متن کاملEfficient Hamming weight-based side-channel cube attacks on PRESENT
Side-channel cube attack (SCCA) is a powerful cryptanalysis technique that combines side-channel attack and cube attack. This paper proposes several advanced techniques to improve the Hamming weight-based SCCA (HW-SCCA) on the block cipher PRESENT. The new techniques utilize non-linear equations and an iterative scheme to extract more information from leakage. The new attacks need only 2 chosen...
متن کاملOn homomorphisms from the Hamming cube to Z
Write F for the set of homomorphisms from {0, 1}d to Z which send 0 to 0 (think of members of F as labellings of {0, 1}d in which adjacent strings get labels differing by exactly 1), and Fi for those which take on exactly i values. We give asymptotic formulae for |F| and |Fi|. In particular, we show that the probability that a uniformly chosen member f of F takes more than five values tends to ...
متن کاملAn Inequality for Functions on the Hamming Cube
We prove an inequality for functions on the discrete cube {0, 1} extending the edgeisoperimetric inequality for sets. This inequality turns out to be equivalent to the following claim about random walks on the cube: Subcubes maximize ’mean first exit time’ among all subsets of the cube of the same cardinality.
متن کاملSymmetry of Factors of the 7-Cube Hamming Shell
A 1-factorization F1 of the complement Σ7 of the perfect Hamming code in the 7cube graphQ7 is given explicitly. For i = 2, 3, the component 1-factors ofF1 can be reunited to form i-factorizations Fi of Σ7 for which the component i-factors are pairwise isomorphic. The smallest connected factors that can be obtained as edge-subset unions from factors of these two factorizations show differing tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Comptes Rendus Mathematique
سال: 2017
ISSN: 1631-073X
DOI: 10.1016/j.crma.2017.09.013